Optimal routing of multiple-load AGV subject to LIFO loading constraints

When simple automated guided vehicles (AGVs) having no random access load transfer mechanism are used for carrying multiple loads between workstations, the loads cannot be handled independently. This paper considers the case when loads are placed in 5at pallets and each new picked up pallet is loaded on the top of batch of pallets already carried by the AGV. To avoid use of excessive space and time needed to reorder pallets in the batch, the loading–unloading procedures should be performed in accordance with last-in-7rst-out (LIFO) rule. In this paper we formulate the condition of existence of AGV routes in which, it visits each workstation only once and meets LIFO constraint. We also suggest an algorithm for 7nding the shortest one among such routes. Examples are provided to illustrate the performance of the algorithm.